Supervenience and Infinitary Logic
نویسنده
چکیده
The discussion of supervenience is replete with the use of infinitary logical operations. For instance, one may often find a supervenient property that corresponds to an infinite collection of supervenience-base properties, and then ask about the infinite disjunction of all those base properties. This is crucial to a well-known argument of Kim (1984) that supervenience comes nearer to reduction than many non-reductive physicalists suppose. It also appears in recent discussions such as Jackson (1998). Some philosophers have been troubled simply by the infinity of such a disjunction. Logicians tend to react somewhat differently. Infinitary logical operations have been studies in depth by the highly developed field of infinitary logic, and many of their properties are well-understood. On the other hand, as anyone who has ever worked with infinitary logic knows, it has proved difficult, messy, and filled with surprising pitfalls. Moreover, there are lots of different infinitary logics, displaying different characteristics, some better, some worse. Logicians are not likely to object to infinitary operations per se, but they are likely to ask whether their application to a metaphysical issue like supervenience work as smoothly as it is sometimes assumed. In this paper, I shall investigate the interaction between supervenience and infinitary logic. Supervenience has long been a point of contact between logic and metaphysics. In examining it, some philosophers have already questioned the metaphysical status of certain finitary logical operations. I shall show here that the step to infinitary logical operations raises significant metaphysical issues of its own. This step, I shall argue, is not an all-or-nothing deal. If we accept the use of infinitary logical operations, we still face hard choices about the strength of such operations to allow. This in turn forces us to confront difficult metaphysical
منابع مشابه
Infinitary equilibrium logic and strongly equivalent logic programs
Strong equivalence is an important concept in the theory of answer set programming. Informally speaking, two sets of rules are strongly equivalent if they have the same meaning in any context. Equilibrium logic was used to prove that sets of rules expressed as propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend this line of...
متن کاملOmitting types for infinitary [0,1]-valued logic
We describe an infinitary logic for metric structures which is analogous to Lω1,ω . We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using topological methods, we prove an omitting types theorem for countable fragments of our infinitary logic. We use omitting types to prove a two-cardinal theorem, which yields...
متن کاملFinite Proofs for Infinitary Formulas
Recent work has shown that the infinitary logic of hereand-there is closely related to the input language of the ASP grounder gringo. A formal system axiomatizing that logic exists, but a proof in that system may include infinitely many formulas. In this note, we define a correspondence between the validity of infinitary formulas in the logic of here-and-there and the provability of formulas in...
متن کاملInfinitary and Cyclic Proof Systems for Transitive Closure Logic
We formulate an infinitary proof system for transitive closure logic, which is the logic obtained by augmenting first-order logics with a transitive closure operator. Our system is an infinite descent-style counterpart to the existing (explicit induction) proof system for the logic. We show that, as for similar systems for first order logic with inductive definitions, our infinitary system is c...
متن کاملHybrid Logics with Infinitary Proof Systems
We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result...
متن کامل